Constrained motion control on a hemispherical surface: path planning.
نویسندگان
چکیده
Surface-constrained motion, i.e., motion constraint by a rigid surface, is commonly found in daily activities. The current work investigates the choice of hand paths constrained to a concave hemispherical surface. To gain insight regarding paths and their relationship with task dynamics, we simulated various control policies. The simulations demonstrated that following a geodesic path (the shortest path between 2 points on a sphere) is advantageous not only in terms of path length but also in terms of motor planning and sensitivity to motor command errors. These stem from the fact that the applied forces lie in a single plane (that of the geodesic path). To test whether human subjects indeed follow the geodesic, and to see how such motion compares to other paths, we recorded movements in a virtual haptic-visual environment from 11 healthy subjects. The task comprised point-to-point motion between targets at two elevations (30° and 60°). Three typical choices of paths were observed from a frontal plane projection of the paths: circular arcs, straight lines, and arcs close to the geodesic path for each elevation. Based on the measured hand paths, we applied k-means blind separation to divide the subjects into three groups and compared performance indicators. The analysis confirmed that subjects who followed paths closest to the geodesic produced faster and smoother movements compared with the others. The "better" performance reflects the dynamical advantages of following the geodesic path and may also reflect invariant features of control policies used to produce such a surface-constrained motion.
منابع مشابه
Dynamics modeling and stable gait planning of a quadruped robot in walking over uneven terrains
Quadruped robots have unique capabilities for motion over uneven natural environments. This article presents a stable gait for a quadruped robot in such motions and discusses the inverse-dynamics control scheme to follow the planned gait. First, an explicit dynamics model will be developed using a novel constraint elimination method for an 18-DOF quadruped robot. Thereafter, an inverse-dynamics...
متن کاملCentralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles
This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...
متن کاملOptimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials
In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estim...
متن کاملPath-constrained Trajectory Planning and Time-independent Motion Control: Application to a Forestry Crane
In this paper we consider the problem of motion planning and control of a kinematically redundant manipulator which is used on forestry machines for logging. Once a desired path is specified in the 3D world frame, a trajectory can be planned and executed such that all joints are synchronized and path-constrained. A speed profile can be chosen according to particular costs (time, fuel consumptio...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of neurophysiology
دوره 111 5 شماره
صفحات -
تاریخ انتشار 2014